Cardinal invariants of monotone and porous sets
نویسندگان
چکیده
A metric space (X, d) is monotone if there is a linear order < on X and a constant c such that d(x, y) 6 c d(x, z) for all x < y < z in X. We investigate cardinal invariants of the σ-ideal Mon generated by monotone subsets of the plane. Since there is a strong connection between monotone sets in the plane and porous subsets of the line, plane and the Cantor set, cardinal invariants of these ideals are also investigated. In particular, we show that non(Mon) > mσ-linked, but non(Mon) < mσ-centered is consistent. Also cov(Mon) < c and cof(N ) < cov(Mon) are consistent.
منابع مشابه
On Cardinal Invariants and Generators for Von Neumann Algebras
We demonstrate how virtually all common cardinal invariants associated to a von Neumann algebra M can be computed from the decomposability number, dec(M), and the minimal cardinality of a generating set, gen(M). Applications include the equivalence of the well-known generator problem, “Is every separably-acting von Neumann algebra singly-generated?”, with the formally stronger questions, “Is ev...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملOn a Theorem of E. Helly
E. Helly’s theorem asserts that any bounded sequence of monotone real functions contains a pointwise convergent subsequence. We reprove this theorem in a generalized version in terms of monotone functions on linearly ordered sets. We show that the cardinal number responsible for this generalization is exactly the splitting number. We also show that a positive answer to a problem of S. Saks is o...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملControl and Cybernetics on Σ-porous and Φ-angle-small Sets in Metric Spaces
It is shown that in metric spaces each (α, φ)-meagre set A is uniformly very porous and its index of uniform v-porosity is not smaller than k−α 3k+α , provided that φ is a strictly k-monotone family of Lipschitz functions and α < k. The paper contains also conditions implying that a k-monotone family of Lipschitz functions is strictly k-monotone.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 77 شماره
صفحات -
تاریخ انتشار 2012